Oscillation Estimates of Eigenfunctions via the Combinatorics of Noncrossing Partitions

نویسندگان

  • Vera Mikyoung Hur
  • Mathew A. Johnson
  • Jeremy L. Martin
چکیده

We study oscillations in the eigenfunctions for a fractional Schrödinger operator on the real line. An argument in the spirit of Courant’s nodal domain theorem applies to an associated local problem in the upper half plane and provides a bound on the number of nodal domains for the extensions of the eigenfunctions. Using the combinatorial properties of noncrossing partitions, we turn the nodal domain bound into an estimate for the number of sign changes in the eigenfunctions. We discuss applications in the periodic setting and the Steklov problem on planar domains.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Noncrossing partitions with fixed points

The noncrossing partitions with each of their blocks containing a given element are introduced and studied. The enumeration of these partitions is described through a polynomial of several variables which is proved to satisfy a recursive formula. It is shown that each variable increased by one is a factor of this polynomial.

متن کامل

Clusters, Noncrossing Partitions and the Coxeter Plane Nathan Reading

The present research is a contribution to W -Catalan combinatorics, which concerns generalizations of objects counted by the Catalan number to an arbitrary finite Coxeter group W. Triangulations of a polygon are a special case of the combinatorial clusters appearing in the theory of cluster algebras of finite type. Planar diagrams analogous to triangulations encode the combinatorics of clusters...

متن کامل

Some Combinatorics Related to Central Binomial Coefficients: Grand-Dyck Paths, Coloured Noncrossing Partitions and Signed Pattern Avoiding Permutations

We give some interpretations to certain integer sequences in terms of parameters on Grand-Dyck paths and coloured noncrossing partitions, and we find some new bijections relating Grand-Dyck paths and signed pattern avoiding permutations. Next we transfer a natural distributive lattice structure on Grand-Dyck paths to coloured noncrossing partitions and signed pattern avoiding permutations, thus...

متن کامل

Coxeter-Catalan Combinatorics

In this talk we will introduce the new and active topic “CoxeterCatalan combinatorics”. We will survey three trends, namely the nonnesting partitions, noncrossing partitions and cluster complexes, leading to this topic. Some new results and unsolved problems will be given.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016